Pattern-based calculi with finitary matching
نویسندگان
چکیده
منابع مشابه
Sorted Psi-calculi with Generalised Pattern Matching
Psi-calculi is a parametric framework for extensions of the pi-calculus, with arbitrary data structures and logical assertions for facts about data. In this paper we extend the applicability of psi-calculi in three ways. Firstly, we introduce patterns and pattern matching, in order to allow modelling of computations on the term language. Secondly, we add sorts to the data term language, to remo...
متن کاملSorted Psi-calculi with Generalised Pattern Matching with proofs
Psi-calculi is a formally verified parametric framework for extensions of the pi-calculus, with arbitrary data structures and logical assertions for facts about data. Although this framework in its original form exhibits considerable expressiveness, many applied computational models cannot be directly represented in it. In this paper we extend the applicability of psi-calculi in three ways. Fir...
متن کاملBimonadic Semantics for Basic Pattern Matching Calculi
The pattern matching calculi introduced by the first author are a refinement of the λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. While related work in the literature only uses a single monad, typically Maybe, for matchings, we present an axiomatic approach to semantics of these pattern matching calculi using two monads, one for exp...
متن کاملBasic Pattern Matching Calculi: a Fresh View on Matching Failure
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with the functional rewriting strategy usually employed to define the operational semantics of pattern matching in non-strict functional programming languages like Haskell or Clean, our pattern matching calculi achieve the s...
متن کاملConfluence of Pattern-Based Calculi
Different pattern calculi integrate the functional mechanisms from the λ-calculus and the matching capabilities from rewriting. Several approaches are used to obtain the confluence but in practice the proof methods share the same structure and each variation on the way patternabstractions are applied needs another proof of confluence. We propose here a generic confluence proof where the way pat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logic Journal of the IGPL
سال: 2017
ISSN: 1367-0751,1368-9894
DOI: 10.1093/jigpal/jzx059